Finding pro le association rules
نویسندگان
چکیده
We have a large database consisting of user proole information together with behavioral patterns. We introduce the concept of proole association rules, which discusses the problem of relating consumer buying behavior to behavioral information. We investigate the problem of online mining of proole association rules in this large database. We show how to use multidimensional indexing structures in order to actually perform the mining. The use of multidimensional indexing structures to perform proole mining provides considerable advantages in terms of the ability to perform very generic range based online queries.
منابع مشابه
Using a Data Mining Tool and FP-Growth Algorithm Application for Extraction of the Rules in two Different Dataset (TECHNICAL NOTE)
In this paper, we want to improve association rules in order to be used in recommenders. Recommender systems present a method to create the personalized offers. One of the most important types of recommender systems is the collaborative filtering that deals with data mining in user information and offering them the appropriate item. Among the data mining methods, finding frequent item sets and ...
متن کاملEnhancing Pro les for Anomaly Detection Using Time Granularities
Recently association rules have been used to generate pro les of normal behavior for anomaly detection However the time factor especially in terms of multiple time granularities has not been studied extensively in generation of these pro les In reality user behavior during di erent time periods in terms of time granularities may be very di erent For example the normal number and dura tion of FT...
متن کاملMining association rules with multiple Min-supports - Application to Symbolic data
RÉSUMÉ. Les données symboliques sont un nouveau paradigme de description de données quand les données sont plus complexes que la forme tabulaire. Elles supportent des données plus structurées ayant des variations internes telles que des distributions, des règles telles que des taxonomies. Depuis son introduction [1], le problème d’extraction de règles d'association à partir de grandes bases de ...
متن کاملAsymptotic Strategy proofness of the Plurality and the Run o Rules
In this paper we prove that the plurality rule and the run o procedure are asymptotically strategy proof for any number of alternatives and that the ratio of the number of all manipulable pro les upon the to tal number of pro les in both cases is it the order of O p n Introduction The well known impossibility theorem of Gibbard and Satterthwaite states that every non dictatorial social choice f...
متن کاملInterpretations of Association Rules by Granular Computing
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association rules). It then uses extended random sets to present a new algorithm of finding interesting rules. It proves that the new algorithm is faster than Pawlak’s algorithm. The extended random sets are easily to include more t...
متن کامل